Correctness Proofs of the Peterson - Fischer Mutual Exclusion Algorithms
نویسنده
چکیده
The Peterson-Fischer 2-process mutual exclusion algorithm [PF] is introduced in a slightly modified form. An invariant-assertional proof of mutual exclusion is presented for the 2-process algorithm. Next, the Peterson-Fischer n-process mutual exclusion algorithm is introduced conceptually as a tournament of [lg n] 2-process competitions. A mutual-exclusion proof of the n-process algorithm is presented, based on a mapping between states of the n-process system and states of the 2-process system. This mapping delineates the correspondence between the 2-process code and one iteration (competition) of the n-process code. In this way, the statement of correctness of the 2-process algorithm is used as a lemma for the n-process proof. Thesis Supervisor: Nancy A. Lynch Title: Professor, Department of Electrical Engineering and Computer Science
منابع مشابه
Proving Correctness of Distributed Algorithms a Petri Net Approach
In this paper we argue that high-level Petri nets are well suited for the representation of distributed algorithms as well as for correctness proofs. A variant of Raymond's message-passing mutual exclusion algorithm serves as an example. Its proof uses techniques that beneet from the syntactical representation of the algorithms in form of a Petri net.
متن کاملVerifying timing properties of concurrent algorithms
This paper presents a method for computer-aided veri cation of timing properties of real-time systems. A timed automaton model, along with invariant assertion and simulation techniques for proving properties of real-time systems, is formalized within the Larch Shared Language. This framework is then used to prove time bounds for two sample algorithms|a simple counter and Fischer's mutual exclus...
متن کاملA Token Based k-Resilient Mutual Exclusion Algorithm for Distributed Systems
This paper presents a token based mutual exclusion algorithm which is k-resilient in that it can tolerate upto k site/link failures. The algorithm uses many features of the token based algorithm by Raymond 5] and inherits many of its advantages , viz. simplicity of the token message and the local data structure at each site. Correctness proofs of the algorithm and complexity analysis are included.
متن کاملDeadlock-Free Information Structure Distributed Mutual Exclusion Algorithms
In the distributed mutual exclusion problem, a set of processes must coordinate their actions so that at any time at most one process may be within its critical section. Information structure distributed mutual exclusion algorithms (ISDME) are instances of a general algorithm which can represent several non-token-based algorithms. This paper introduces a new deadlock-free ISDME algorithm (DF-IS...
متن کاملDISC 20th Anniversary: Invited Talk My Early Days in Distributed Computing Theory: 1979-1982
I first became involved in Distributed Computing Theory around 1978 or 1979, as a new professor at Georgia Tech. Looking back at my first few years in the field, approximately 1979-1982, I see that they were tremendously exciting, productive, and fun. I collaborated with, and learned from, many leaders of the field, including Mike Fischer, Jim Burns, Michael Merritt, Gary Peterson, Danny Dolev,...
متن کامل